@inproceedings{odell+w:dynamic,
  author    = {Regina O'Dell and
               Roger Wattenhofer},
  title     = {Information dissemination in highly dynamic graphs},
  booktitle = {DIALM-POMC},
  year      = {2005},
  pages     = {104-110},
}

@Book{pelegbook,
  author = "David Peleg",
  title = "Distributed Computing: A Locality-Sensitive Approach",
  publisher = "SIAM",
  year = "2000",
}

@Book{leightonbook,
author = "F. Thomson Leighton",
title = "Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes",
publisher = "Morgan Kaufmann",
year = "1991"
}

@inproceedings{clementi-podc12,
 author = {Andrea Clementi and Riccardo Silvestri and Luca Trevisan},
 title = {Information Spreading in Dynamic Graphs},
 booktitle = {PODC},
 year = {2012}
 }

@article{arxiv,
  author    = {C. Dutta and
               G. Pandurangan and R. Rajaraman and Z. Sun},
  title     = {Information Spreading in Dynamic Networks},
  journal   = {CoRR},
  volume    = {abs/1112.0384},
  year      = {2011},
  ee        = {http://arxiv.org/abs/1112.0384}
}

@article{santoro,
  author    = {Arnaud Casteigts and
               Paola Flocchini and
               Walter Quattrociocchi and
               Nicola Santoro},
  title     = {Time-Varying Graphs and Dynamic Networks},
  journal   = {CoRR},
  volume    = {abs/1012.0009},
  year      = {2010},
  ee        = {http://arxiv.org/abs/1012.0009},
  note  = {Short version in  ADHOC-NOW 2011}
  }

@inproceedings{rw-podc,
  author    = {A. {Das Sarma} and A. Molla and
               G. Pandurangan},
  title     = {Fast Distributed Computation in Dynamic Networks via Random Walks},
  booktitle = {Manuscript},
  year      = {2012}
}

@misc{personal,
author = {B. Haeupler and F. Kuhn},
howpublished = {Personal communication},
}
%month = {February},
%year = {2012}

@inproceedings{avin1, 
author = {C. Avin and M. Borokhovich and K. Censor-Hillel and Z. Lotker},
title = {Order Optimal Information Spreading Using Algebraic Gossip},
booktitle = {ACM  PODC},
year = {2011}
}


@inproceedings{avin2,
author = {M. Borokhovich and C. Avin and Z. Lotker},
title = {Tight Bounds for Algebraic Gossip on Graphs},
booktitle = {IEEE ISIT},
year = {2010}
}

@inproceedings{p2p-soda,
author = {J. Augustine and G. Pandurangan and P. Robinson and E. Upfal},
title = {Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks},
booktitle = {ACM-SIAM SODA},
year = {2012}
}

@inproceedings{p2p-focs,
author    = {G. Pandurangan and P. Raghavan and E. Upfal},
title     = {Building Low-Diameter P2P Networks},
booktitle = {IEEE FOCS},
year      = {2001}
}
  
@article{kuhn-survey,
author = {F. Kuhn and R. Oshman},
title = {Dynamic networks: Models and algorithms},
journal ={SIGACT News},
volume = {42(1)},
year = {2011}
} 

@inproceedings{kuhn-podc, 
author = {F. Kuhn and R. Oshman and Y. Moses},
title = {Coordinated consensus in dynamic networks}, 
booktitle = {ACM PODC},
year ={2011}
}  

@inproceedings{kuhn+lo:dynamic,
 author = {F. Kuhn and N. Lynch and R. Oshman},
 title = {Distributed computation in dynamic networks},
 booktitle = {ACM STOC},
 year = {2010}
} 

@article{chernoff,
title = {Asymptotic efficiency for tests based on the sum of observations},
author = {H. Chernoff},
journal = {Math. Stat.},
year = {1952}
}

@article{hoeffding,
title = {Probability for sums of bounded random variables},
author = {W. Hoeffding},
journal = {Journal of American Statistical Association},
year = {1963}
}

@article{angluin,
title = {Fast probabilistic algorithms for Hamiltonian circuits and matchings},
author = {D. Angluin and L. G. Valiant},
journal = {Journal of Computer and System Sciences},
year = {1979}
}

@book{upfal,
title = {Probability and Computing: Randomized Algorithms and Probabilistic Analysis},
author = {M. Mitzenmacher and E. Upfal},
publisher = {Cambridge University Press},
year = {2004}
}

@article{jain+ms:steiner,
title = {Packing {Steiner} trees},
author = {K. Jain and M. Mahdian and M. Salavatipour},
journal = {ACM-SIAM SODA},
year = {2003},
}

@article{cheriyan+s:steiner,
title = {Hardness and Approximation Results for Packing {Steiner} Trees},
author = {J. Cheriyan and M. Salavatipour},
journal = {Algorithmica},
year = {2006},
}

@article{charikar+ccdgg:steiner,
title = {Approximation Algorithms for Directed {Steiner} Problems},
author = {M. Charikar and C. Chekuri and T. Cheung and Z. Dai and A. Goel and S. Guha},
journal = {Journal of Algorithms},
year = {1998}
}

@article{lau:steiner,
title = {An approximate max-steiner-tree-packing min-steiner-cut theorem},
author = {L. C. Lau},
journal = {IEEE FOCS},
year = {2004}
}

@article{guruswami+krsy,
title = {Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems},
author = {V. Guruswami and S. Khanna and R. Rajaraman and B. Shepherd and M. Yannakakis},
journal = {ACM STOC},
year = {1999}
}

@inproceedings{haeupler:gossip,
author = {B. Haeupler},
title = {Analyzing network coding gossip made easy},
booktitle = {ACM STOC},
year = {2011}
} 

@inproceedings{haeupler+k:dynamic,
author = {B. Haeupler and D. Karger},
title = {Faster information dissemination in dynamic networks via network coding},
booktitle = {ACM PODC},
year = {2011}
} 

@article{gafni:dynamic,
title = {End-to-end communication in unreliable networks},
author = {E. Gafni and Y. Afek},
journal = {ACM PODC},
year = {1988}
}

@INPROCEEDINGS{afek+gr:slide,
author = {Y. Afek and E. Gafni and A. Rosen},
title = {The Slide Mechanism with Applications in Dynamic Networks},
booktitle = {ACM PODC},
year = {1992}
}

@article{awerbuch:adversarial,
title = {Simple Routing Strategies for Adversarial Systems},
author = {B. Awerbuch and P. Berenbrink and A. Brinkmann and C. Scheideler},
journal = {IEEE FOCS},
year = {2002}
}

@article{awerbuch:icalp,
title = {Anycasting in adversarial systems: Routing and admission control},
author = {B. Awerbuch and A. Brinkmann and C. Scheideler},
journal = {ICALP},
year = {2003}
}

@book{leighton:book,
author = {F. T. Leighton},
title = {Introduction to Parallel Algorithms and Architectures: Arrays,
Trees, and Hypercubes},
publisher = {Morgan-Kaufmann},
year = {1991}
}

@book{lynch:distributed,
author = {N. A. Lynch},
title = {Distributed Algorithms},
publisher = {Morgan Kaufmann},
year = {1996}
}

@book{attiya+w:distributed,
author = {H. Attiya and J. Welch},
title = {Distributed Computing: Fundamentals, Simulations and Advanced Topics (2nd edition)},
publisher = {John Wiley Interscience},
year = {2004}
}

@article{topkis:disseminate,
 author = {Topkis, Donald M.},
 title = {Concurrent Broadcast for Information Dissemination},
 journal = {IEEE Trans. Softw. Eng.},
 volume = {11},
 issue = {10},
 year = {1985},
 pages = {1107--1112}
} 

@book{dolev:stabilize,
author = {S. Dolev},
title = {Self-stabilization},
publisher = {MIT Press},
year = {2000}
}

@article{gafni+b:link-reversal,
author = {E. Gafni and B. Bertsekas},
title = {Distributed algorithms for generating loop-free routes in networks with
frequently changing topology},
journal = {IEEE Trans. Comm.},
volume = "29",
year = "1981",
}
%number = "1",
%pages = "11–18",

@INPROCEEDINGS{afek+ag:dynamic,                                                                            
author = {Y. Afek and B. Awerbuch and E. Gafni},
title = {Applying Static Network Protocols to Dynamic Networks},
booktitle = {IEEE FOCS},  
year = {1987}
}      

@INPROCEEDINGS{awerbuch+pps:dynamic,
author = {B. Awerbuch and B. Patt-Shamir and D. Peleg and M. E. Saks},
title = {Adapting to Asynchronous Dynamic Networks},
booktitle = {ACM STOC},
year = {1992}  
}

@inproceedings{awerbuch+l:flow,
author = {B. Awerbuch and F. T. Leighton},
title = {Improved Approximation Algorithms for the Multi-commodity
Flow Problem and Local Competitive Routing in Dynamic Networks},
booktitle = {ACM STOC}, 
year = {1994}
}

@inproceedings{awerbuch+bbs:route,
author = {B. Awerbuch and P. Berenbrink and A. Brinkmann and C. Scheideler},
title = {Simple Routing Strategies for Adversarial Systems},
booktitle = {IEEE FOCS},
year = {2001}
}

@inproceedings{jia+rs:adhoc,
author = {L. Jia and R. Rajaraman and C. Scheideler},
title = {On Local Algorithms for Topology Control and Routing in Ad Hoc Networks},
booktitle = {ACM SPAA},
year = {2003},
}

@INPROCEEDINGS{awerbuch+bs:anycast,
author = {B. Awerbuch and A. Brinkmann and C. Scheideler},
title = {Anycasting in Adversarial Systems: Routing and Admission Control.},
booktitle = {ICALP},
year = {2003}  
}

@article{alon+blp:radio,
author = {N. Alon and A. Bar-Noy and N. Linial and D. Peleg},
title = {A Lower Bound for Radio Broadcast},
journal = {Journal of Computer and System Sciences},
volume = {43},
year = {1991},
pages = {290--298},
}

@INPROCEEDINGS{clementi+ms:radio,
author = {Andrea E. F. Clementi and A. Monti and R. Silvestri},
title = {Distributed multi-broadcast in unknown radio networks.},
booktitle = {ACM PODC},
pages = {255-264},
year = {2001}  
}

@inproceedings{bar-yehuda+gi:radio,
author = {R. Bar-Yehuda and O. Goldreich and A. Itai},
title = {On the time-complexity of broadcast in radio networks: an exponential gap between determinism and randomization},
booktitle = {ACM PODC},
year = {1987}
} 

@article{ahlswede+cly:coding,
author = {R. Ahlswede and N. Cai and S. Li and R. Yeung},
title = {Network information flow},
journal = {Transactions on Information Theory},
volume = {46},
number = {4},
pages = {1204--1216}, 
year = {2000},
}

@inproceedings{zosin+k:steiner,
author = {L. Zosin and S. Khuller},
title = {On Directed {Steiner} Trees},
booktitle = {ACM-SIAM SODA},
year = {2002},
}

@INPROCEEDINGS{sanders+et:flow,
author = {P. Sanders and S. Egner and L. Tolhuizen},
title = {Polynomial Time Algorithms for Network Information Flow},
booktitle = {ACM SPAA},
year = {2003}
}

@inproceedings{kempe1, 
author = {D. Kempe and J. Kleinberg},
title ={Protocols and Impossibility Results for Gossip-Based Communication Mechanisms}, 
booktitle = {IEEE FOCS},
year = {2002}
}

@article{chen-spaa,
author = {J. Chen and G. Pandurangan},
title = {Optimal Gossip-based Aggregate Computation},
journal = {SIAM Journal on Computing},
volume = {41(3)},
pages = {455-483},
note = {Conference version: ACM SPAA, 2012},
year = {2012}
}

@inproceedings{demers,
author = {A. Demers and D. Greene and C. Hauser and W. Irish and J. Larson and S. Shenker and H. Sturgis and D. Swinehart and D. Terry},
title = {Epidemic algorithms for replicated database maintenance},
booktitle = {ACM PODC},
year = {1987},
}
%pages = {1--12},

@inproceedings{shah,
author = {D. Mosk-Aoyama and D. Shah},
title = {Computing separable functions via gossip},
booktitle = {ACM PODC},
year = {2006}
 }

@inproceedings{karp,
author = {R. M. Karp and C. Schindelhauer and S. Shenker and B. V\"{o}cking},
title = {Randomized rumor spreading},
booktitle = {IEEE FOCS},
year = {2000}
}

@inproceedings{kempe,
author ={D. Kempe and A. Dobra and J. Gehrke},
title={Gossip-based Computation of Aggregate Information},
booktitle={IEEE FOCS},
year={2003},
pages={482--491}
}

@article{boyd,
author = {S. Boyd and A. Ghosh and B. Prabhakar and D. Shah},
title = {Randomized gossip algorithms},
journal = {IEEE Trans. on Infor. Theory},
volume = {52},
number = {6},
year = {2006},
pages = {2508--2530}
}

@INPROCEEDINGS{berenbrink+ceg:gossip,
author = {P. Berenbrink and J. Czyzowicz and R. Els{\"{a}}sser and L. Gasieniec},
title = {Efficient Information Exchange in the Random Phone-Call Model},
booktitle = {ICALP},
year = {2010}
}

@ARTICLE{bar-noy+gns:multicast,
author = {A. Bar-Noy and S. Guha and J. Naor and B. Schieber},
title = {Message Multicasting in Heterogeneous Networks.},
journal = {SIAM J. Comput.},
pages = {347-358},
year = {2000}  
}


@ARTICLE{bar-yehuda+ii:radio,
    author = {Reuven Bar-Yehuda and Amos Israeli and Alon Itai},
    title = {Multiple Communication in Multi-Hop Radio Networks},
    journal = {SIAM Journal on Computing},
    year = {1993},
    volume = {22},
    pages = {875--887}
}

@article{clementi+mps:radio,
  author    = {Andrea E. F. Clementi and
               Angelo Monti and
               Francesco Pasquale and
               Riccardo Silvestri},
  title     = {Broadcasting in dynamic radio networks},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {75},
  number    = {4},
  year      = {2009},
  pages     = {213-230},
}

@inproceedings{chlebus+kpr:radio,
  author    = {Bogdan S. Chlebus and
               Dariusz R. Kowalski and
               Andrzej Pelc and
               Mariusz A. Rokicki},
  title     = {Efficient Distributed Communication in Ad-Hoc Radio Networks},
  booktitle = {ICALP (2)},
  year      = {2011},
  pages     = {613-624},
 }

@inproceedings{avin+kl:dynamic,
author = {C. Avin and M. Kouck\'{y}  and Z. Lotker},
title = {How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)},
booktitle = {ICALP},
year = {2008}
} 

@inproceedings{agarwal+c:coding,
title = {On the advantage of Network Coding for Improving Network Throughput},
author = {A. Agarwal and M. Charikar},
booktitle = {Information Theory Workshop},
year = {2004}
}

@article{deb+mc:coding,
author = {S. Deb and M. M\'{e}dard and C. Choute},
title = {Algebraic gossip: a network coding approach to optimal multiple rumor mongering},
journal = {IEEE/ACM Trans. Netw.},
volume = {14},
year = {2006},
} 
%month = {June},
%pages = {2486--2507},
